γH2AX spreading linked to homology search

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

γH2AX spreading linked to homology search

*Correspondence to: Stefan Jentsch; Email: [email protected] Submitted: 06/03/2013; Accepted: 06/05/2013 http://dx.doi.org/10.4161/cc.25836 Comment on: Renkawitz J, et al. Mol Cell 2013; 50:261-72; PMID:23523370; http://dx.doi.org/10.1016/j.molcel.2013.02.020 DNA double-strand breaks (DSBs) are one of the most toxic types of DNA damage, as their inaccurate repair results in mutations and c...

متن کامل

Caching Spreading Activation Search

Spreading activation search is an approach to determine similarity of graph vertices based on energy distribution. Computation of such energy distribution is defined by a simple, but time-expensive recurrent procedure. This paper introduces a caching strategy, which can speed up computation of energy distribution of vertices that are closely connected to already calculated vertices.

متن کامل

Modern Homology Search

Dynamic programming [1] has full sensitivity, but too slow for large scale homology search. FASTA / BLAST type of heuristics [2] trade sensitivity for speed. Can we have both sensitivity and speed? We present the mathematical theory of optimized spaced seeds which allows modern homology search to achieve high sensitivity and high speed simultaneously. The spaced seed methodology is implemented ...

متن کامل

Homology search for genes

MOTIVATION Life science researchers often require an exhaustive list of protein coding genes similar to a given query gene. To find such genes, homology search tools, such as BLAST or PatternHunter, return a set of high-scoring pairs (HSPs). These HSPs then need to be correlated with existing sequence annotations, or assembled manually into putative gene structures. This process is error-prone ...

متن کامل

Homology Search Methods

Homology search methods have advanced substantially in recent years. Beginning with the elegant Needleman-Wunsch and Smith-Waterman dynamic programming techiques of the 1970s, algorithms have been developed that were appropriate for the data sets and computer systems of their times. As data sets grew, faster but less sensitive heuristic algorithms, such as FASTA and BLAST, became a dominant for...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Cell Cycle

سال: 2013

ISSN: 1538-4101,1551-4005

DOI: 10.4161/cc.25836